#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 1e4 + 5;

int n, m;
int a[N];

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  priority_queue<int, vector<int>, greater<int>> pq;
  rep(i, 1, n) {
    int x;
    cin >> x;
    pq.push(x);
  }
  ll sum = 0;
  rep(i, 2, n) {
    int x = pq.top();
    pq.pop();
    int y = pq.top();
    pq.pop();
    int z = x + y;
    sum += z;
    pq.push(z);
  }
  cout << sum;
  return 0;
}